Spiking neurons and the induction of finite state machines
نویسندگان
چکیده
منابع مشابه
Spiking neurons and the induction of finite state machines
We discuss in this short survey article some current mathematical models from neurophysiology for the computational units of biological neural systems: neurons and synapses. These models are contrasted with the computational units of common arti$cial neural network models, which re.ect the state of knowledge in neurophysiology 50 years ago. We discuss the problem of carrying out computations in...
متن کاملSystematic Construction of Finite State Automata Using VLSI Spiking Neurons
Spiking neural networks implemented using electronic Very Large Scale Integration (VLSI) circuits are promising information processing architectures for carrying out complex cognitive tasks in real-world applications. These circuits are developed using standard silicon technologies, and exploit the analog properties of transistors to emulate the phenomena underlying the computations and the com...
متن کاملInduction and State Machines
This short paper describes a well-known and a non-standard technique for proving properties about sequential circuits. The techniques are based on transforming the circuit to an abstract state machine, and performing several ways of induction on these state machines. We conclude with an insightful correspondence between the two techniques. The proposed methods have been implemented in an experi...
متن کاملLearning Finite State Machines
The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata formalisms, and particularly on determinis...
متن کاملFinite state machines
Finite State Machines, in short FSMs, are formalisms that have been used for decades to describe the behavior of systems. They can also provide an intelligent agent with a suitable formalism for describing its own beliefs about the behavior of the world surrounding it. In fact, FSMs are the suitable acceptors for right linear languages, which are the simplest languages considered in Chomsky’s c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00099-3